Improved AND/OR Tree Search Algorithm in Analysis of Stochastic and Time-Dependent Shortest Path Problem

Real-time vehicle guidance effectively reduces traffic jams and improves the operational efficiency of urban transportation. The trip time on a route is considered as random process that changes with time, shortest path selection requires dynamic model solution decision-making problem. Thus, criterion to determine by programming (DP) which discretizes times in continuous segments route. In this study, numerical established using probability tree an AND/OR (AO∗) algorithm select time. results show branches are only accumulated “quantity” do not cause “qualitative” change. inefficient accumulation affects algorithm, so it important separate from node expansion. according entering into segment, demands improved AO∗ algorithm. new balances between provides optimal real-time road.